Completeness Theorems and the Separation of the First and Higher-Order Logic
نویسنده
چکیده
With his 1929 thesis Gödel delivers himself to us almost fully formed. He gives in it a definitive, mathematical treatment of the completeness theorem; but he also declares himself philosophically, with a cluster of philosophical ruminations, some argumentation, and some slightly mysterious philosophical remarks, in this first example of the bold extraction of philosophical observations from mathematical facts, which would become Gödel’s modus operandi and professional trademark. These latter remarks were never included in the publication based on the thesis – an unfortunate excision, perhaps, as Gödel would not be inclined to publish such unbuttoned philosophical material until the 1940s with his contribution to the Schilpp volume on Russell, ∗Research partially supported by a grant NWO and grant 40734 of the Academy of Finland. 1The author thanks the NWO foundation for their support during the writing of this paper; Steve Awodey, Paolo Mancosu, Dana Scott and Wilfried Sieg for helpful comments and correspondence about the material in Gödel’s thesis. The author is especially grateful to Jouko Väänänen, for extensive discussions about first and higher order logic.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملDistributed Contingency Logic and Security
In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...
متن کاملSOME RESULTS ON INTUITIONISTIC FUZZY SPACES
In this paper we define intuitionistic fuzzy metric and normedspaces. We first consider finite dimensional intuitionistic fuzzy normed spacesand prove several theorems about completeness, compactness and weak convergencein these spaces. In section 3 we define the intuitionistic fuzzy quotientnorm and study completeness and review some fundamental theorems. Finally,we consider some properties of...
متن کاملSuzuki-type fixed point theorems for generalized contractive mappings that characterize metric completeness
Inspired by the work of Suzuki in [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861--1869], we prove a fixed point theorem for contractive mappings that generalizes a theorem of Geraghty in [M.A. Geraghty, On contractive mappings, Proc. Amer. Math. Soc., 40 (1973), 604--608]an...
متن کاملA Stone-Type Duality Theorem for Separation Logic via its Underlying Bunched Logics
Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because — in addition to elegant abstraction — they strengthen soundness and completeness to a categorical equivalence, yielding a framework through which both algebraic and topological methods can be brought to bear on a logic. We give a systematic treatment of Stone-type duality...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007